AN ALGORITHM FOR FINDING CLIQUE CUT-SETSWHITESIDES SH.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 1; PP. 31-32; BIBL. 1 REF.Article

ON A FEW CLIQUE-GRAPH EQUATIONSSATO I.1978; TRU MATH; JPN; DA. 1978; VOL. 14; NO 2; PP. 31-36; BIBL. 4 REF.Article

CLIQUE DETECTION IN DIRECTED GRAPHS: A NEW ALGORITHM.MEEUSEN W; CAYVERS L.1975; J. COMPUT. APPL. MATH.; BELG.; DA. 1975; VOL. 1; NO 3; PP. 185-203; BIBL. 17 REF.Article

ON A CLIQUE COVERING PROBLEM OF ORLINGREGORY DA; PULLMAN NJ.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 97-99; BIBL. 4 REF.Article

ON CLIQUE - DIVERGENT GRAPHSNEUMANN LARA V.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 313-315; ABS. FRE; BIBL. 4 REF.Conference Paper

Clique graphs of time graphsHEDMAN, B.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 270-278, issn 0095-8956Article

Decomposition by clique separatorsTARJAN, R. E.Discrete mathematics. 1985, Vol 55, Num 2, pp 221-232, issn 0012-365XArticle

A note on a conjecture by Gavril on clique separable graphsCORNEIL, D. G; KEIL, J. M.Discrete mathematics. 1983, Vol 46, Num 3, pp 317-318, issn 0012-365XArticle

APPLICATION OF DICLIQUE REPRESENTATION TO GRAPH HOMOMORPHISM DETECTIONLASKI JW; PAKER Y; KORTAS K et al.1978; PRACE I.P.I. P.A.N.; POL; DA. 1978; NO 331; PP. 1-34; ABS. RUS/POL; BIBL. 5 REF.Serial Issue

A REMARK ON SYSTEMS OF MAXIMAL CLIQUES OF A GRAPH.ZELINKA B.1977; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1977; VOL. 27; NO 4; PP. 617-618Article

A NOTE ON PSEUDOINTERSECTION GRAPHS.SLATER PJ.1976; J. RES. NATION. BUR. STAND., B; U.S.A.; DA. 1976; VOL. 80B; NO 4; PP. 441-445; BIBL. 9 REF.Article

On a circle placement problemCHAZELLE, B. M; LEE, D. T. K.Computing (Wien. Print). 1986, Vol 36, Num 1-2, pp 1-16, issn 0010-485XArticle

Decomposition of perfect graphsWEN-LIAN HSU.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 1, pp 70-94, issn 0095-8956Article

Extension of a clique cover result to uniform hypergraphsSHELTON, A. P; DUTTON, R. D; BRIGHAM, R. C et al.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 199-201, issn 0012-365XArticle

Duality and perfection for edges in cliquesALBERTSON, M. O; COLLINS, K. L.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 3, pp 298-309, issn 0095-8956Article

Applications of edge coverings by cliquesROBERTS, F. S.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 93-109, issn 0166-218XArticle

Maximum weight clique algorithms for circular-ARC graphs and circle graphsWEN-LIAN HSU.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 224-231, issn 0097-5397Article

Algorithms to find directed packingsDAWSON, J. E.North-Holland mathematics studies. 1985, Vol 114, Num 26, pp 137-141, issn 0304-0208Article

Independence, clique size and maximum degreeFAJTLOWICZ, S.Combinatorica (Print). 1984, Vol 4, Num 1, pp 35-38, issn 0209-9683Article

GRAPHES DE GROUPES AVEC CLIQUES MAXIMALES DISJOINTESCOCKAYNE EJ; HEDETNIEMI ST.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 81-82; ABS. FRE; BIBL. 3 REF.Conference Paper

The complexity of generalized clique coveringCORNELL, D. G; FONLUPT, J.Discrete applied mathematics. 1988, Vol 22, Num 2, pp 109-118, issn 0166-218XArticle

Embedding maximal cliques of sets in maximal cliques of bigger setsDRAKE, D. A.Discrete mathematics. 1986, Vol 58, Num 3, pp 229-242, issn 0012-365XArticle

Spectral bounds for the clique and independence numbers of graphsWILF, H. S.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 1, pp 113-117, issn 0095-8956Article

Clique graphs of packed graphsSATO, I.Discrete mathematics. 1986, Vol 62, Num 1, pp 107-109, issn 0012-365XArticle

Minimal clique partitions and parwise balanced designsREES, R.Discrete mathematics. 1986, Vol 61, Num 2-3, pp 269-280, issn 0012-365XArticle